package com.ruima.study.arithmetic.dynamicplanning;

public class Demo2 {
    public static void main(String[] args) {

    }

    public int calPackage(int[] weights, int[] values, int maxWeight){
        int n = weights.length;

        int[][] states = new int[n][maxWeight];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < maxWeight; j++) {
                
            }
            
        }
        return 1;
    }


}
